منابع مشابه
Nielsen Number of a Covering Map
Is it possible to find a formula expressing the Nielsen number N( f ) by the numbers N( ̃ f ) where ̃ f runs the set of all lifts? Such a formula seems very desirable since the difficulty of computing the Nielsen number often depends on the size of the fundamental group. Since π1 ̃ X ⊂ π1X , the computation of N( ̃ f ) may be simpler. We will translate this problem to algebra. The main result of th...
متن کاملNielsen Number and Differential Equations
In reply to a problem of Jean Leray (application of the Nielsen theory to differential equations), two main approaches are presented. The first is via Poincaré’s translation operator, while the second one is based on the Hammerstein-type solution operator. The applicability of various Nielsen theories is discussed with respect to several sorts of differential equations and inclusions. Links wit...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملThe chromatic covering number of a graph
Following [1], we investigate the problem of covering a graph G with induced subgraphs G1, . . . , Gk of possibly smaller chromatic number, but such that for every vertex u of G, the sum of reciproquals of the chromatic numbers of the Gi’s containing u is at least 1. The existence of such “chromatic coverings” provides some bounds on the chromatic number of G.
متن کاملPath covering number and L(2,1)-labeling number of graphs
A path covering of a graph G is a set of vertex disjoint paths of G containing all the vertices of G. The path covering number of G, denoted by P (G), is the minimum number of paths in a path covering of G. An k-L(2, 1)-labeling of a graph G is a mapping f from V (G) to the set {0, 1, . . . , k} such that |f(u) − f(v)| ≥ 2 if dG(u, v) = 1 and |f(u) − f(v)| ≥ 1 if dG(u, v) = 2. The L(2, 1)-label...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fixed Point Theory and Applications
سال: 2006
ISSN: 1687-1820,1687-1812
DOI: 10.1155/fpta/2006/37807